Representation Dependence in Probabilistic Inference
نویسندگان
چکیده
Non-deductive reasoning systems are often representation dependent, representing the same situation in two different ways may cause such a system to return two different answers. This is generally viewed as a significant problem. For example, the principle of maximum entropy has been subjected to much criticism due to its representation dependence. There has, however, been almost no work investigating representation dependence. In this paper, we formalize this notion and show that it is not a problem specific to maximum entropy. In fact, we show that any probabilistic inference system that sanctions certain important patterns of reasoning, such as a minimal default assumption of independence, must suffer from representation dependence. We then show that invariance under a restricted class of representation changes can form a reasonable compromise between representation independence and other desiderata.
منابع مشابه
Approximating Probabilistic Inference in Bayesian Belief Networks
A belief network comprises a graphical representation of dependencies between variables of a domain and a set of conditional probabilities associated with each dependency. Unless P=NP, an efficient, exact algorithm does not exist to compute probabilistic inference in belief networks. Stochastic simulation methods, which often improve run times, provide an alternative to exact inference algorith...
متن کاملRepresentation Independence of Nonmonotonic Inference Relations
A logical concept of representation independence is developed for nonmonotonic logics , including probabilistic inference systems. The general framework then is applied to several nonmonotonic logics, particularly propo-sitional probabilistic logics. For these logics our investigation leads us to modiied inference rules with greater representation independence .
متن کاملIntelligent Probabilistic Inference
The analysis of practical probabilistic models on the computer demands a convenient representation for the available knowledge and an efficient algorithm to perform inference. An appealing representation is the influence diagram, a network that makes explicit the random variables in a model and their probabilistic dependencies. Recent advances have developed solution procedures based on the inf...
متن کاملUsing Iterative Deepening for Probabilistic Logic Inference
We present a novel approach that uses an iterative deepening algorithm in order to perform probabilistic logic inference for ProbLog, a probabilistic extension of Prolog. The most used inference method for ProbLog is exact inference combined with tabling. Tabled exact inference first collects a set of SLG derivations which contain the probabilistic structure of the ProbLog program including the...
متن کاملProbabilistic-Fuzzy Inference Procedures for Knowledge-Based Systems
This paper presents a proposition of the knowledge representation and the inference procedure including two types of uncertainty: probabilistic and fuzzy. Added weights to the fuzzy rule-based model state probabilities of fuzzy events in antecedents and consequents. The exemplary calculations are presented. Key-Words: Fuzzy sets, Knowledge representation, Inference procedure, Probability of fuz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995